منابع مشابه
Factorizations of Cyclic Words
Weinbaum [Proc.AMS, 109(3):615–619, 1990] showed that for each letter a in a primitive word w, there exists a conjugate w = uv of w such that both u and v are uniquely positioned in the cyclic word w such that u begins and ends with a and v neither begins nor ends with a. We give a generalization of this result using iterative methods.
متن کاملEfficient parallel independent subsets and matrix factorizations
A parallel algorithm is given for computation of a maximal linearly independent subset of a set of vectors over a eld. The algorithm uses polylogarithmic time and uses a number of processors that diiers by only a polylog factor from the number required for fast parallel matrix inversion. It is used to produce eecient parallel algorithms for orthogonalizations of arbitrary matrices over real eld...
متن کاملFactoring Certain Infinite Abelian Groups by Distorted Cyclic Subsets
We will prove that two results on factoring finite abelian groups into a product of subsets, related to Hajós’s and Rédei’s theorems, can be extended for certain infinite torsion abelian groups. Mathematics Subject Classification (2000): Primary 20K01; Secondary
متن کاملOn complete subsets of the cyclic group
A subset X of an abelian G is said to be complete if every element of the subgroup generated by X can be expressed as a nonempty sum of distinct elements from X . Let A ⊂ Zn be such that all the elements of A are coprime with n. Solving a conjecture of Erdős and Heilbronn, Olson proved that A is complete if n is a prime and if |A| > 2√n. Recently Vu proved that there is an absolute constant c, ...
متن کاملA Search Procedure for Cyclic Subsets
In this paper, a polynomial time algorithm for finding the set of all cyclic subsets in a graph is presented. The concept of cyclic subsets has already been introduced in an earlier paper. The algorithm finds cyclic subsets in a graph G by conjoining “building block” subsets of length three in V(G). We prove the correctness of this algorithm and present an asymptotic time complexity analysis of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1990
ISSN: 0021-8693
DOI: 10.1016/0021-8693(90)90208-6